Positive definiteness of tridiagonal matrices via the numerical range

Positive definiteness of tridiagonal matrices via the numerical range

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

Positive Integer Powers of the Tridiagonal Toeplitz Matrices

In this paper we present an explicit expression for the arbitrary positive integer powers of the tridiagonal Toeplitz matrices.

PERRON-FROBENIUS THEORY ON THE NUMERICAL RANGE FOR SOME CLASSES OF REAL MATRICES

We give further results for Perron-Frobenius theory on the numericalrange of real matrices and some other results generalized from nonnegative matricesto real matrices. We indicate two techniques for establishing the main theorem ofPerron and Frobenius on the numerical range. In the rst method, we use acorresponding version of Wielandt's lemma. The second technique involves graphtheory.

Positive integer powers of certain complex tridiagonal matrices

In this paper, we firstly present a general expression for the entries of the th r   N r power of certain -square n are complex tridiagonal matrix, in terms of the Chebyshev polynomials of the first kind. Secondly, we obtain two complex factorizations for Fibonacci and Pell numbers. We also give some Maple 13 procedures in order to verify our calculations.